Minimum-cost delegation in service composition
نویسندگان
چکیده
منابع مشابه
Online and Minimum-Cost Delegation in Service Composition
The paradigm of automated service composition through the integration of existing services promises a fast and efficient development of new services in cooperative service (e.g., business) environments. Although the “why” part of this paradigm is well understood, many key pieces are missing to utilize the available opportunities. Recently “service communities” where service providers with simil...
متن کاملQuality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objective is the utilization of existing services to respond to new business requirements in a timely manner. In this context, the service delegation problem can be formulated as follows: When a user poses a sequence of reques...
متن کاملStrategic delegation under cost asymmetry
We revisit the two-stage duopoly game with strategic delegation and asymmetric technologies of Sen and Stamatopoulos (2015). We show that their conclusions are misled by the restrictive assumption that the extent of delegation to managers is restricted to a binary set. Allowing for a continuous set of delegation incentives, we prove that the delegation stage is a prisonersdilemma, the unique s...
متن کاملCost Pass-through under Delegation
The rate of cost pass-through exceeds 50% under strategic delegation of decision-making to managers with sales revenue contracts regardless of the number of rms in the industry and demand curvature. This contrasts sharply with pro t-maximization, for which cost pass-through can take on any positive value. The key intuition is that rms under delegation act as if they faced more rivals than th...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.08.040